Transformations for functional verification of synthesized designs

نویسندگان

  • William L. Bradley
  • Ranga Vemuri
چکیده

A major problem with low-level functional verii-cation of any hierarchical system is the explosion of reachable states created when clocking mechanisms are incorporated into the model. These additional states make veriication more diicult, usually to the point that veriication at such a low level is not feasible. Transforms have been developed to take a nonhierarchi-cal model with a complex clocking mechanism and generate a provably equivalent model with a single clock. Furthermore, an algorithm has been developed to take a model with a complex clocking mechanism, described as a hierarchical network of modules, and generate a provably equivalent model with a single clock. These transformed models have a reduced state set and can be veriied in place of the original models in a fraction of the original time. This allows a synthesis system to generate simpler veriication models, while their results will be applicable to the original designs.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Symbolic Approach for Checking Functional and Timing Compatibility of Synthesized Designs

In a redesign situation, the compatibility of the replacement chips is critical. This can only be obtained by verifying both their functionality and timing. In this report, we will postulate that the general RTL verification problem is too difficult to be solved. Hence, it is necessary for a RTL verification system to trade off generality for usability. In fact, there is a real need for an auto...

متن کامل

Automated Formal Equivalence Verification of Pipelined Nested Loops in Datapath Designs

The ever-growing complexity of digital systems has made designers move toward using Electronic System Level (ESL) design methodology at a higher abstraction level. The designs at ESL are then automatically synthesized to Register Transfer Level (RTL) by means of High Level or behavioral Synthesis (HLS) tools. Due to possibility of buggy synthesis, especially when the target design must be manip...

متن کامل

Formal Verification for High-Assurance Behavioral Synthesis

We present a framework for certifying hardware designs generated through behavioral synthesis, by using formal verification to certify the associated synthesis transformations. We show how to decompose this certification into two components, which can be respectively handled by the complementary verification techniques, theorem proving and model checking. The approach produces a certified refer...

متن کامل

Verification of arithmetic datapath designs using word-level approach - A case study

The paper describes an efficient method to prove equivalence between two integer arithmetic datapath designs specified at the register transfer level. The method is illustrated with an industrial ALU design. As reported in literature, solving it using a commercial equivalence checking tool required casesplitting, which limits its applicability to larger designs. We show how such a task can be s...

متن کامل

Synthesizing checkers for on-line verification of System-on-Chip designs

In modern System-on-Chip (SoC) designs verification becomes the major bottleneck. Since by using state-of-theart techniques complete designs cannot be fully formally verified, it becomes more and more important to check the correct behaviour during operation. This becomes even more significant in systems that are changed during lifetime, like re-configurable systems. In this paper we present a ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995